A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
نویسندگان
چکیده
منابع مشابه
Summary of “A Distributed Algorithm for Minimum-Weight Spanning Trees”
This document summarizes the article published by Gallagerher et. al on “A Distributed Algorithm for Minimum-Weight Spanning Trees”. The asynchronous distributed algorithm determines a minimum-weight spanning tree for an undirected graph that has distinct finite weights for every edge.
متن کاملA Sub-Linear Time Distributed Algorithm for Minimum-Weight Spanning Trees
This paper considers the question of identifying the parameters governing the behavior of fundamental global network problems. Many papers on distributed network algorithms consider the task of optimizing the running time successful when an O(n) bound is achieved on an n-vertex network. We propose that a more sensitive parameter is the network’s diameter Diam. This is demonstrated in the paper ...
متن کاملA distributed approximation algorithm for the minimum degree minimum weight spanning trees
Fischer [3] has shown how to compute a minimum weight spanning tree of degree at most b∆∗ + ⌈logb n⌉ in time O(n 4+1/ln ) for any constant b > 1, where ∆∗ is the value of an optimal solution and n is the number of nodes in the network. In this paper, we propose a distributed version of Fischer’s algorithm that requires messages and time complexity O(n ), and O(n) space per node.
متن کاملEvaluating a sublinear-time algorithm for the Minimum Spanning Tree Weight problem
Abstract. We present an implementation and an experimental evaluation of an algorithm that, given a connected graph G (represented by adjacency lists), estimates in sublinear time, with a relative error e, the Minimum Spanning Tree Weight of G (see [1] for a theoretical exposure of the algorithm). Since the theoretical performances have already been shown and demonstrated in the above-mentioned...
متن کاملApproximating the Minimum Spanning Tree Weight in Sublinear Time
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a parameter 0 < ε < 1/2, estimates in time O(dwε log dw ε ) the weight of the minimum spanning tree of G with a relative error of at most ε. Note that the running time does not depend on the number of vertices in G. We ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1998
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539794261118